An Algebraic Approach for Path-Diversity Multiple-Description-Coding Scenario

Packet transmission over computer networks is the main reference framework for most information technology applications. Packet loss is one of the main problems affecting performance. Various techniques have been proposed to protect packets from losses, one is distributing information on the network in order to exploit the characteristics of the network itself allowing adaptivity and flexibility. In this work we propose an algebraic framework for estimate of the number of independent paths (Path Diversity) on a network. Path Diversity knowledge is showed to be extremely important for applications making use of distributed information. Joint use of Path Diversity and Multiple Description Coding allows more efficient transmissions and can be generalized to the case when network coding is allowed on internal nodes of the network.